A transport model for tree ring width.
نویسندگان
چکیده
منابع مشابه
A note on clique-width and tree-width for structures
We give a simple proof that the straightforward generalisation of clique-width to arbitrary structures can be unbounded on structures of bounded tree-width. This can be corrected by allowing fusion of elements.
متن کاملDeciding Clique-Width for Graphs of Bounded Tree-Width
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta and Ioannis G. Tollis: submitted October 2001; revised July 2002 and February 2003. The work of the second author was supported by the German Research Association (DFG) grant WA 674/9-2. W. Espelage et al., Deciding Cli...
متن کاملA Note on Tree-width Path-width and Cutwidth*
Let tw(G), pw(G), c(G), !J.(G) denote, respectively, the tree-width, path-width, cutwidth and the maximum degree of a graph G on 11 vertices . It is known that c (G)~tw (G). We prove that c (G) =0 (tw (G)·!J.(G)·logn), and if ({Xj : iel] ,T=(I,A» is a tree decomposition of G with tree-wid~ then c (G) S (k+ l)·!J.(G)·c (T). In case that a tree decomposition is given, or that the tree-width is bo...
متن کاملBounding connected tree-width
Diestel and Müller showed that the connected tree-width of a graph G, i. e., the minimum width of any tree-decomposition with connected parts, can be bounded in terms of the tree-width of G and the largest length of a geodesic cycle in G. We improve their bound to one that is of correct order of magnitude. Finally, we construct a graph whose connected tree-width exceeds the connected order of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Silva Fennica
سال: 1997
ISSN: 2242-4075
DOI: 10.14214/sf.a8523